Nuclear mass systematics by complementing the Finite Range Droplet Model with neural networks
نویسندگان
چکیده
منابع مشابه
Nuclear mass systematics by complementing the Finite Range Droplet Model with neural networks
A neural-network model is developed to reproduce the differences between experimental nuclear mass-excess values and the theoretical values given by the Finite Range Droplet Model. The results point to the existence of subtle regularities of nuclear structure not yet contained in the best microscopic/phenomenological models of atomic masses. Combining the FRDM and the neural-network model, we c...
متن کاملNuclear mass systematics using neural networks
New global statistical models of nuclidic (atomic) masses based on multilayered feedforward networks are developed. One goal of such studies is to determine how well the existing data, and only the data, determines the mapping from the proton and neutron numbers to the mass of the nuclear ground state. Another is to provide reliable predictive models that can be used to forecast mass values awa...
متن کاملFINITE-TIME PASSIVITY OF DISCRETE-TIME T-S FUZZY NEURAL NETWORKS WITH TIME-VARYING DELAYS
This paper focuses on the problem of finite-time boundedness and finite-time passivity of discrete-time T-S fuzzy neural networks with time-varying delays. A suitable Lyapunov--Krasovskii functional(LKF) is established to derive sufficient condition for finite-time passivity of discrete-time T-S fuzzy neural networks. The dynamical system is transformed into a T-S fuzzy model with uncertain par...
متن کاملAircraft Visual Identification by Neural Networks
In the present paper, an efficient method for three dimensional aircraft pattern recognition is introduced. In this method, a set of simple area based features extracted from silhouette of aerial vehicles are used to recognize an aircraft type from its optical or infrared images taken by a CCD camera or a FLIR sensor. These images can be taken from any direction and distance relative to the fly...
متن کاملComplementing Two-Way Finite Automata
We study the relationship between the sizes of two-way finite automata accepting a language and its complement. In the deterministic case, for a given automaton (2dfa) with n states, we build an automaton accepting the complement with at most 4n states, independently of the size of the input alphabet. Actually, we show a stronger result, by presenting an equivalent 4n-state 2dfa that always hal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: HNPS Proceedings
سال: 2019
ISSN: 2654-0088,2654-007X
DOI: 10.12681/hnps.2250